Negative association in uniform forests and connected graphs

We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the negative association of two edges is reviewed for a uniform forest, and a related conjecture is posed for a uniform connected subgraph. The former conjecture is verified numerically for all graphs $G$ having eight or fewer vertices, or having nine vertices and no more than eighteen edges, using a certain computer algorithm which is summarised in this paper. Negative association is known already to be valid for a uniform spanning tree. The three cases of uniform forest, uniform spanning tree, and uniform connected subgraph are special cases of a more general conjecture arising from the random-cluster model of statistical mechanics.Comment: With minor correction

Robust nonparametric detection of objects in noisy images

We propose a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We present an algorithm that allows to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required. The algorithm has linear complexity and exponential accuracy and is appropriate for real-time systems. In this paper, we develop further the mathematical formalism of our method and explore important connections to the mathematical theory of percolation and statistical physics. We prove results on consistency and algorithmic complexity of our testing procedure. In addition, we address not only an asymptotic behavior of the method, but also a finite sample performance of our test.Comment: This paper initially appeared in 2010 as EURANDOM Report 2010-049. Link to the abstract at EURANDOM repository: http://www.eurandom.tue.nl/reports/2010/049-abstract.pdf Link to the paper at EURANDOM repository: http://www.eurandom.tue.nl/reports/2010/049-report.pd

Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is exponentially small. Moreover, for random fields obeying a certain Markov property, we show that the ratio between the numbers of occurrences of two distinct patterns on a cluster is concentrated around a constant value. This leads to an elegant and simple proof of the ratio limit theorem for these random fields, which states that the ratio of the probabilities that the cluster of the origin has sizes n+1 and n converges as n tends to infinity. Implications for the maximal cluster in a finite box are discussed.Comment: 23 pages, 2 figure

Directed percolation effects emerging from superadditivity of quantum networks

Entanglement indcued non--additivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisiting of butterfly-type entanglement breaking channels augmented, with some probability, by identity channels are analyzed. The capacity superadditivity in the network is manifested in directed correlated bond percolation which we consider in two flavours: simply directed and randomly oriented. The obtained percolation properties show that high capacity information transfer sets in much faster in the regime of superadditive communication capacity than otherwise possible. As a byproduct, this sheds light on a new type of entanglement based quantum capacity percolation phenomenon.Comment: 6 pages, 4 figure

Critical percolation of free product of groups

In this article we study percolation on the Cayley graph of a free product of groups. The critical probability $p_c$ of a free product $G_1*G_2*...*G_n$ of groups is found as a solution of an equation involving only the expected subcritical cluster size of factor groups $G_1,G_2,...,G_n$. For finite groups these equations are polynomial and can be explicitly written down. The expected subcritical cluster size of the free product is also found in terms of the subcritical cluster sizes of the factors. In particular, we prove that $p_c$ for the Cayley graph of the modular group $\hbox{PSL}_2(\mathbb Z)$ (with the standard generators) is $.5199...$, the unique root of the polynomial $2p^5-6p^4+2p^3+4p^2-1$ in the interval $(0,1)$. In the case when groups $G_i$ can be "well approximated" by a sequence of quotient groups, we show that the critical probabilities of the free product of these approximations converge to the critical probability of $G_1*G_2*...*G_n$ and the speed of convergence is exponential. Thus for residually finite groups, for example, one can restrict oneself to the case when each free factor is finite. We show that the critical point, introduced by Schonmann, $p_{\mathrm{exp}}$ of the free product is just the minimum of $p_{\mathrm{exp}}$ for the factors

Random-cluster representation of the Blume-Capel model

The so-called diluted-random-cluster model may be viewed as a random-cluster representation of the Blume--Capel model. It has three parameters, a vertex parameter $a$, an edge parameter $p$, and a cluster weighting factor $q$. Stochastic comparisons of measures are developed for the `vertex marginal' when $q\in[1,2]$, and the `edge marginal' when q\in[1,\oo). Taken in conjunction with arguments used earlier for the random-cluster model, these permit a rigorous study of part of the phase diagram of the Blume--Capel model

Computing the entropy of user navigation in the web

Navigation through the web, colloquially known as "surfing", is one of the main activities of users during web interaction. When users follow a navigation trail they often tend to get disoriented in terms of the goals of their original query and thus the discovery of typical user trails could be useful in providing navigation assistance. Herein, we give a theoretical underpinning of user navigation in terms of the entropy of an underlying Markov chain modelling the web topology. We present a novel method for online incremental computation of the entropy and a large deviation result regarding the length of a trail to realize the said entropy. We provide an error analysis for our estimation of the entropy in terms of the divergence between the empirical and actual probabilities. We then indicate applications of our algorithm in the area of web data mining. Finally, we present an extension of our technique to higher-order Markov chains by a suitable reduction of a higher-order Markov chain model to a first-order one

Approximate quantum error correction, random codes, and quantum channel capacity

We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This result is then used to analyze the average error correcting performance of codes that are randomly drawn from unitarily invariant code ensembles. Our results confirm that random codes of sufficiently large block size are highly suitable for quantum error correction. Moreover, employing a lemma of Bennett, Shor, Smolin, and Thapliyal, we prove that random coding attains information rates of the regularized coherent information.Comment: 29 pages, final version to appear in Phys. Rev. A, improved lower bound for code entanglement fidelity, simplified proo